Efficient maximum-likelihood decoding of spherical lattice codes
نویسندگان
چکیده
منابع مشابه
Maximum Likelihood Decoding of Reed Solomon Codes
We present a randomized algorithm which takes as input n distinct points {(xi, yi)}i=1 from F ×F (where F is a field) and integer parameters t and d and returns a list of all univariate polynomials f over F in the variable x of degree at most d which agree with the given set of points in at least t places (i.e., yi = f(xi) for at least t values of i), provided t = Ω( √ nd). The running time is ...
متن کاملFountain Codes under Maximum Likelihood Decoding
This dissertation focuses on fountain codes under maximum likelihood (ML) decoding. Fountain codes are a class of erasure correcting codes that can generate an endless amount of coded symbols and were conceived to deliver data files over data networks to a potentially large population of users. First Luby transform (LT) codes are considered, which represent the first class of practical fountain...
متن کاملIterative Maximum Likelihood Decoding Ofgeneralized Spacetimeblock Codes
GENERALIZED SPACE-TIME BLOCK CODES A. Lee Swindlehurst Dept. of Elec. & Comp. Engineering, Brigham Young University, Provo, UT, USA, 84602 e-mail: [email protected] ABSTRACT An iterative algorithm for ML detection of a certain class of space-time codes is presented. Codes within this general framework employ redundant linear precoding, and include as special cases many recently proposed algori...
متن کاملConvolutional Codes II. Maximum-Likelihood Decoding
Find the secret to improve the quality of life by reading this convolutional codes ii maximum likelihood decoding. This is a kind of book that you need now. Besides, it can be your favorite book to read after having this book. Do you ask why? Well, this is a book that has different characteristic with others. You may not need to know who the author is, how well-known the work is. As wise word, ...
متن کاملMaximum-likelihood soft decision decoding of BCH codes
The problem of efficient maximum-likelihood soft decision decoding of binary BCH codes is considered. It is known that those primitive BCH codes whose designed distance is one less than a power of two, contain subcodes of high dimension which consist of a direct sum of several identical codes. We show that the same kind of direct-sum structure exists in all the primitive BCH codes. as well as i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2009
ISSN: 0090-6778
DOI: 10.1109/tcomm.2009.08.070329